Adaptive spectral clustering for conformation analysis
نویسندگان
چکیده
Markov state models have become very popular for the description of conformation dynamics of molecules over long timescales. The construction of such models requires a partitioning of the configuration space such that the discretization can serve as an approximation of metastable conformations. Since the computational complexity for the construction of a Markov state model increases quadratically with the number of sets, it is desirable to obtain as few sets as necessary. In this paper we propose an algorithm for the adaptive refinement of an initial coarse partitioning. A spectral clustering method is applied to the final partitioning to detect the metastable conformations. We apply this method to the conformation analysis of a model tri-peptide molecule, where metastable β and γ-turn conformations can be identified.
منابع مشابه
Adaptive spectral clustering with application to tripeptide conformation analysis.
A decomposition of a molecular conformational space into sets or functions (states) allows for a reduced description of the dynamical behavior in terms of transition probabilities between these states. Spectral clustering of the corresponding transition probability matrix can then reveal metastabilities. The more states are used for the decomposition, the smaller the risk to cover multiple conf...
متن کاملAn Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors
The construction of a similarity matrix is one significant step for the spectral clustering algorithm; while the Gaussian kernel function is one of the most common measures for constructing the similarity matrix. However, with a fixed scaling parameter, the similarity between two data points is not adaptive and appropriate for multi-scale datasets. In this paper, through quantitating the value ...
متن کاملA Self-adaptive Spectral Clustering Based on Geodesic Distance and Shared Nearest Neighbors
Spectral clustering is a method of subspace clustering which is suitable for the data of any shape and converges to global optimal solution. By combining concepts of shared nearest neighbors and geodesic distance with spectral clustering, a self-adaptive spectral clustering based on geodesic distance and shared nearest neighbors was proposed. Experiments show that the improved spectral clusteri...
متن کاملPrediction of slope stability using adaptive neuro-fuzzy inference system based on clustering methods
Slope stability analysis is an enduring research topic in the engineering and academic sectors. Accurate prediction of the factor of safety (FOS) of slopes, their stability, and their performance is not an easy task. In this work, the adaptive neuro-fuzzy inference system (ANFIS) was utilized to build an estimation model for the prediction of FOS. Three ANFIS models were implemented including g...
متن کاملA robust adaptive clustering analysis method for automatic identification of clusters
Identifying the optimal cluster number and generating reliable clustering results are necessary but challenging tasks in cluster analysis. The effectiveness of clustering analysis relies not only on the assumption of cluster number but also on the clustering algorithm employed. This paper proposes a new clustering analysis method that identifies the desired cluster number and produces, at the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010